Information geometry for testing pseudorandom number generators
نویسنده
چکیده
The information geometry of the 2-manifold of gamma probability density functions provides a framework in which pseudorandom number generators may be evaluated using a neighbourhood of the curve of exponential density functions. The process is illustrated using the pseudorandom number generator in Mathematica. This methodology may be useful to add to the current family of test procedures in real applications to finite sampling data.
منابع مشابه
Some Illustrations of Information Geometry in Biology and Physics
Many real processes have stochastic features which seem to be representable in some intuitive sense as `close to Poisson’, `nearly random’, `nearly uniform’ or with binary variables `nearly independent’. Each of those particular reference states, defined by an equation, is unstable in the formal sense, but it is passed through or hovered about by the observed process. Information geometry gives...
متن کاملSome illustrations of information geometry in biology and physics ∗
Many real processes have stochastic features which seem to be representable in some intuitive sense as 'close to Poisson', 'nearly random', 'nearly uniform' or with binary variables 'nearly independent'. Each of those particular reference states, defined by an equation, is unstable in the formal sense, but it is passed through or hovered about by the observed process. Information geometry gives...
متن کاملTechniques for Testing the Quality of Parallel Pseudorandom Number Generators
Ensuring that pseudorandom number generators have good randomness properties is more complicated in a multiprocessor implementationthan in the uniprocessor case. We discuss simple extensions of uniprocessor testing for SIMD parallel streams, and develop in detail a repeatability test for the SPMD paradigm. Examples of the application of these tests to an additive lagged-Fibonacci generator are ...
متن کاملA Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material. Generators suitable for use in cryptographic applications may need to meet stronger requirements than for other applications. In particular, their outputs must be unpredictable...
متن کاملAn Overview of Cryptographically Secure Pseudorandom Number generators and BBS
In this manuscript we have presented a literature survey of cryptographically securepseudo random number generators, their requirements regarding statistical properties and next bit test. The paper also provides a brief overview of Blum Blum Shub (BBS) Generator specifically, which is considered to be the best cryptographically secure pseudorandom number generator. We have performed the rigorou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009